Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
661	The other hard problem: How to bridge the gap between subsymbolic and symbolic cognition Axel Cleeremans Cognitive Science Research Unit Add to Reading List Source URL: srsc-mac1.ulb.ac.be Language: English - Date: 1998-08-22 15:52:49 Philosophy of mind Axel Cleeremans Computational neuroscience Cognitive architecture Connectionism Cognitive science Implicit learning ACT-R Concept learning Learning Cognition Science
662	On the inadmissibility of non-evolutionary shocks Add to Reading List Source URL: eprints.whiterose.ac.uk Language: English - Date: 2014-06-05 04:56:02 Fluid mechanics Computational fluid dynamics Plasma physics Space plasmas Magnetohydrodynamics Differential equation Riemann problem Dissipative system Hyperbolic partial differential equation Physics Fluid dynamics Calculus
663	Journal of Artificial Intelligence Research[removed]429 Submitted 6/06; published 3/07 Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems Add to Reading List Source URL: www.jair.org Language: English - Date: 2009-08-06 19:20:44 NP-complete problems Discrete geometry Operations research Combinatorial optimization Bin packing problem Generalized assignment problem Knapsack problem Packing problem Strongly NP-complete Theoretical computer science Computational complexity theory Mathematics
664	A Signature Scheme as Secure as the Diffie-Hellman Problem Eu-Jin Goh and StanisÃlaw Jarecki Computer Science Department, Stanford University, Stanford CA[removed]removed], [removed] Add to Reading List Source URL: www.iacr.org Language: English - Date: 2008-09-15 00:54:52 Computational hardness assumptions BLS Schnorr signature Forking lemma Digital signature XTR ElGamal encryption Random oracle Diffie–Hellman problem Cryptography Public-key cryptography Finite fields
665	On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas ˇ ˇ Ondˇrej Cepek and Stefan Add to Reading List Source URL: www.cs.uic.edu Language: English - Date: 2013-12-21 14:10:02 Logic in computer science Boolean algebra Complexity classes NP-complete problems Conjunctive normal form Computational problems 2-satisfiability Boolean satisfiability problem Disjunctive normal form Theoretical computer science Computational complexity theory Applied mathematics
666	The Chaos Within Sudoku M´ aria Ercsey-Ravasz1, ∗ and Zolt´an Toroczkai2, 3, † arXiv:1208.0370v1 [nlin.CD] 1 Aug 2012 Add to Reading List Source URL: arxiv.org Language: English - Date: 2012-08-02 20:18:34 NP-complete problems Logic puzzles Recreational mathematics Constraint programming Logic in computer science 2-satisfiability Sudoku Constraint satisfaction Boolean satisfiability problem Theoretical computer science Mathematics Computational complexity theory
667	SODA14 – Accepted Papers Andreas Björklund, Petteri Kaski and Łukasz Kowalik Counting thin subgraphs via packings faster than meet-in-the-middle time Anand Louis and Konstantin Makarychev Approximation Algorithm for Add to Reading List Source URL: siam.org Language: English - Date: 2013-09-19 09:13:08 NP-complete problems Approximation algorithm Submodular set function Shortest path problem Bin packing problem Vertex cover Dominating set Independent set Computational complexity theory Theoretical computer science Graph theory Mathematics
668	Toward a General Solution to the Symbol Grounding Problem: Combining Learning and Computer Vision Add to Reading List Source URL: aaai.org Language: English - Date: 2006-01-11 02:45:05 Semantics Learning Machine learning Philosophy of language Computational neuroscience Concept learning Symbol grounding Connectionism Supervised learning Cognition Science Knowledge
669	Learning Structured Prediction Models: A Large Margin Approach Ben Taskar Computer Science, UC Berkeley, Berkeley, CA[removed]removed] Add to Reading List Source URL: ai.stanford.edu Language: English - Date: 2005-10-04 19:09:30 Mathematical optimization Operations research Linear programming Convex optimization Computational problems Optimization problem Semidefinite programming 3-dimensional matching Duality Mathematics Theoretical computer science Applied mathematics
670	Algorithmica[removed]:[removed]Algorithmica[removed]Springer-Verlag New York Inc. Efficient Convexity and Domination Algorithms for Add to Reading List Source URL: deepblue.lib.umich.edu Language: English - Date: 2015-01-16 14:55:31 Sorting algorithms Convex hull algorithms Algorithm Mathematical logic Theoretical computer science Hypercube Bitonic sorter Convex hull LP-type problem Geometry Mathematics Computational geometry

UPDATE